The Maximality of the Typed Lambda Calculus and of Cartesian Closed Categories
نویسندگان
چکیده
From the analogue of Böhm’s Theorem proved for the typed lambda calculus, without product types and with them, it is inferred that every cartesian closed category that satisfies an equality between arrows not satisfied in free cartesian closed categories must be a preorder. A new proof is given here of these results, which were obtained previously by Richard Statman and Alex K. Simpson. Mathematics Subject Classification (1991): 03B40, 18D15, 18A15, 03G30
منابع مشابه
Cartesian Closed Double Categories, Their Lambda-Notation, and the Pi-Calculus
We introduce the notion of cartesian closed double category to provide mobile calculi for communicating systems with specific semantic models: One dimension is dedicated to compose systems and the other to compose their computations and their observations. Also, inspired by the connection between simply typed -calculus and cartesian closed categories, we define a new typed framework, called dou...
متن کاملNormalization by Evaluation for Typed Lambda Calculus with Coproducts
Abstract We solve the decision problem for simply typed lambda calculus with strong binary sums, equivalently the word problem for free cartesian closed categories with binary coproducts. Our method is based on the semantical technique known as “normalization by evaluation” and involves inverting the interpretation of the syntax into a suitable sheaf model and from this extracting appropriate u...
متن کاملA Generalization of the Curry-Howard Correspondence
We present a variant of the calculus of deductive systems developed in [5, 6], and give a generalization of the Curry-Howard-Lambek theorem giving an equivalence between the category of typed lambda-calculi and the category of cartesian closed categories and exponentialpreserving morphisms that leverages the theory of generalized categories [13]. We discuss potential applications and extensions.
متن کاملMPhil in Advanced Computer Science Advanced
SYLLABUS A range of topics for the course follows. 1. Algebraic theories: universal algebra; equational logic; soundness and completeness; theory translations and constructions. 2. Algebras: initial algebras; induction principle; recursive domain equations; free algebras. 3. Presheaves: cartesian closure; essential geometric morphisms; free cocompletions; Kan extensions; coends. 4. Simply typed...
متن کاملDependent Cartesian Closed Categories
We present a generalization of cartesian closed categories (CCCs) for dependent types, called dependent cartesian closed categories (DCCCs), which also provides a reformulation of categories with families (CwFs), an abstract semantics for Martin-Löf type theory (MLTT) which is very close to the syntax. Thus, DCCCs accomplish mathematical elegance as well as a direct interpretation of the syntax...
متن کامل